Note on Perfect Forests
نویسنده
چکیده
A spanning subgraph F of a graph G is called perfect if F is a forest, the degree dF (x) of each vertex x in F is odd, and each tree of F is an induced subgraph of G. We provide a short proof of the following theorem of A.D. Scott (Graphs & Combin., 2001): a connected graph G contains a perfect forest if and only if G has an even number of vertices.
منابع مشابه
Perfect distance forests
In 1975, Leech introduced the problem of finding trees whose edges can be labeled with positive integers so that the sums of the edge labels between vertices is {1, 2, · · · , (n 2 )}, where n is the number of vertices. We refer to such trees as perfect distance trees. In a previous paper, this problem was generalized to graphs in general and in particular, forests. Here, we show that tK1,2 can...
متن کاملPlanar Graphs with Many Perfect Matchings and Forests
We determine the number of perfect matchings and forests in a family Tr,3 of triangulated prism graphs. These results show that the extremal number of perfect matchings in a planar graph with n vertices is bounded below by Ω ( 6 √ 7 + √ 37 n) = Ω (1.535) and the extremal number of forests contained in a planar graph with n vertices is bounded below by
متن کاملNote on Perfect Forests in Digraphs
A spanning subgraph F of a graph G is called perfect if F is a forest, the degree dF (x) of each vertex x in F is odd, and each tree of F is an induced subgraph of G. Alex Scott (Graphs & Combin., 2001) proved that every connected graph G contains a perfect forest if and only if G has an even number of vertices. We consider four generalizations to directed graphs of the concept of a perfect for...
متن کاملA note on Fouquet-Vanherpe’s question and Fulkerson conjecture
The excessive index of a bridgeless cubic graph $G$ is the least integer $k$, such that $G$ can be covered by $k$ perfect matchings. An equivalent form of Fulkerson conjecture (due to Berge) is that every bridgeless cubic graph has excessive index at most five. Clearly, Petersen graph is a cyclically 4-edge-connected snark with excessive index at least 5, so Fouquet and Vanherpe as...
متن کاملA Note on Non-unitarisable Representations and Random Forests
We establish a connection between Dixmier’s unitarisability problem and the expected degree of random forests on a group. As a consequence, a residually finite group is non-unitarisable if its first L-Betti number is non-zero or if it is finitely generated with non-trivial cost.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 82 شماره
صفحات -
تاریخ انتشار 2016